Induced matchings in intersection graphs
نویسندگان
چکیده
منابع مشابه
Induced matchings in intersection graphs
An induced matching in a graph G is a set of edges, no two of which meet a common node or are joined by an edge of G; that is, an induced matching is a matching which forms an induced subgraph. Induced matchings in graph G correspond precisely to independent sets of nodes in the square of the line-graph of G, which we denote by [L(G)]. Often, if G has a nice representation as an intersection gr...
متن کاملInduced matchings in cubic graphs
In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching.
متن کاملMaximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملInduced matchings in bipartite graphs
All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...
متن کاملPerfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problems of this type, based on the concept of a balanced join in an embedded graph. We use this method to prove that bridgeless cubic graphs of oddness two have Fano colorings using only 5 lines of the Fano plane. This is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.05.001